Eigenvector Sensitivity: A Kharitonov Result
نویسنده
چکیده
This study is motivated by a need to effectively determine the difference between a system fault and normal system operation under parametric uncertainty using eigenstructure analysis. This involves computational robustness of eigenvectors in linear state space systems dependent upon uncertain parameters. The work involves the development of practical algorithms which provide for computable robustness measures on the achievable set of eigenvectors associated with certain state space matrix constructions. To make connections to a class of systems for which eigenvalue and characteristic root robustness are well understood, the work begins by focusing on companion form matrices associated with a polynomial whose coefficients lie in specified intervals. The work uses an extension of the well known theories of Kharitonov that provides computational efficient tests for containment of the roots of the polynomial (and eigenvalues of the companion matrices) in “desirable” regions, such as the left half of the complex plane.
منابع مشابه
The Kharitonov theorem with degree drop
The purpose of this note is to present a proof of the Kharitonov theorem based on Bezoutians. An interesting consequence of this proof is that it shows the validity of Kharitonov’s result in the presence of a degree drop.
متن کاملH∞ Performance of Interval Systems
In this paper, we study H∞ performance of interval systems. We prove that, for an interval system, the maximal H∞ norm of its sensitivity function is achieved at twelve (out of sixteen) Kharitonov vertices.
متن کاملThe Kharitonov theorem and its applications in symbolic mathematical computation †
The Kharitonov theorem provides a means of performing sensitivity analysis for the complex roots of polynomials whose coefficients (in power base) are perturbed. In particular, it gives a computationally feasible algorithm for testing if the roots remain contained on the left hand side of the Gaussian plane if one perturbes each coefficient of a monic polynomial by a given amount. We survey an ...
متن کاملPerformance of Interval Systems
In this paper, we study H∞ performance of interval systems. We prove that, for an interval system, the maximal H∞ norm of its sensitivity function is achieved at twelve (out of sixteen) Kharitonov vertices.
متن کاملInstability conditions for linear time delay systems: a Lyapunov matrix function approach
The construction of Lyapunov–Krasovskii functionals with prescribed time derivative in the framework of the stability analysis of time delay systems has been addressed in several works, starting with the contributions of Repin (1965) and Datko (1971). In the past decade, this topic has been revisited by Kharitonov and Zhabko (2003), with the so-called functionals of complete type whose time der...
متن کامل